Probabilistic relational categories are learnable as long as you don’t know you’re learning probabilistic relational categories
نویسندگان
چکیده
Kittur, Hummel and Holyoak (2004) showed that people have great difficulty learning relation-based categories with a probabilistic (i.e., family resemblance) structure. We investigated three interventions hypothesized to facilitate learning family-resemblance based relational categories: Naming the relevant relations, providing a hint to look for a family resemblance structure, and changing the description of the task from learning about categories to choosing the “winning” object in each stimulus, which was predicted to encourage subjects to form an invariant higher-order relation. We crossed these variables orthogonally in a factorial design. Of the three, the change in task description had by far the greatest impact on subjects’ ability to learn probabilistic relation-based categories. For subjects in the category learning task, naming the relations and the “no single relation” clue both improved performance individually, but in combination, they substantially impaired learning. These results suggest that the best way to learn a probabilistic relation-based category is to discover a higher-order relation that remains invariant over the category’s exemplars.
منابع مشابه
Making Probabilistic Relational Categories Learnable
Theories of relational concept acquisition (e.g., schema induction) based on structured intersection discovery predict that relational concepts with a probabilistic (i.e., family resemblance) structure ought to be extremely difficult to learn. We report four experiments testing this prediction by investigating conditions hypothesized to facilitate the learning of such categories. Experiment 1 s...
متن کاملProgressive Alignment Facilitates Learning of Deterministic But Not Probabilistic Relational Categories
Kotovsky and Gentner (1996) showed that presenting progressively aligned examples helped children discover relational similarities: Comparisons based on initially concrete and highly similar, but progressively more abstract exemplars helped the discovery of higher-order relational similarities. We investigated whether progressive alignment can aid learning of relational categories with either a...
متن کاملRevisiting Wittgenstein’s puzzle: hierarchical encoding and comparison facilitate learning of probabilistic relational categories
Kittur et al. (2004, 2006) and Jung and Hummel (2011, 2014) showed that people have great difficulty learning relation-based categories with a probabilistic (i.e., family resemblance) structure, in which no single relation is shared by all members of a category. Yet acquisition of such categories is not strictly impossible: in all these studies, roughly half the participants eventually learned ...
متن کاملFeature- vs. Relation-Defined Categories: Probab(alistic)ly Not the Same
Relational categories underlie many uniquely human cognitive processes including analogy, problem solving, and scientific discovery. Despite their ubiquity and importance, the field of category learning has focused almost exclusively on categories based on features. Classification of featurebased categories is typically modeled by calculating similarity to stored representations, an approach th...
متن کاملSchemas and Models
We propose the Schema-Model Framework, which characterizes algorithms that learn probabilistic models from relational data as having two parts: a schema that identifies sets of related data items and groups them into relevant categories; and a model that allows probabilistic inference about those data items. The framework highlights how relational learning techniques must structure their own le...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009